Algorithms and VLSI Architectures for Low-Power Mobile Face Verification
نویسنده
چکیده
Among the biometric modalities suitable for mobile applications, face verification is definitely an interesting one, because of its low level of invasiveness, and because it is easily applicable from the user viewpoint. Additionally, a reduced cost of the identity verification device is possible when sharing the imaging device between different applications. This is for instance not possible with fingerprint verification, which asks for a specific sensor. This Ph.D. thesis addresses the problem of conceiving a low-power face authentication system adapted to the stringent requirements of mobile communicators, including the study and design of the algorithms, and the mixed hardware and software implementation on a dedicated multi-processors platform. With respect to the anterior state-of-art, this thesis proposes several original algorithmic improvements, and an original architecture for a VLSI System-On-Chip realization, where the algorithmic and architectural aspects have been jointly optimized, so as to enable the execution of the face verification to be entirely processed on low-power mobile devices such as mobile phones, or personal digital assistants. At the time when this work was undertaken and completed, there were no similar results published either from the academic scientific community, or from the market in form of a product description / announcement. The mobile environment is known to be characterized by large variations in image acquisition conditions with regard to the scene acquisition viewpoint and illumination, and it is therefore requiring a sound optimization of the algorithmic robustness. Moreover, face verification is a quite complex task that is usually performed on powerful possibly
منابع مشابه
Neuromorphic vision sensors for mobile robots
Real-time vision-based vehicle navigation tasks are typically computationally intensive and significantly complex in terms of resources used. Moreover, mobile applications of navigation systems place severe constraints on their size and power consumption. These constraints can be satisfied by using parallel image processing architectures and parallel control algorithms implemented with analog V...
متن کاملHomogeneous and Heterogeneous MPSoC Architectures with Network-On-Chip Connectivity for Low-Power and Real-Time Multimedia Signal Processing
Two multiprocessor system-on-chip (MPSoC) architectures are proposed and compared in the paper with reference to audio and video processing applications. One architecture exploits a homogeneous topology; it consists of 8 identical tiles, each made of a 32bit RISC core enhanced by a 64-bit DSP coprocessor with local memory. The other MPSoC architecture exploits a heterogeneoustile topology with ...
متن کاملVlsi. Circuit Complexity and Decoding Performance Analysis for Low-power Rsc Turbo-code and Iterative Block Decoders Design *
A VLSI circuit complexity analysis for low-power decoder designs is presented. Two low-complexity adaptive decoder architectures incorporating the ~ecursive systematic codes (turbo-codes) and the block-codes are considered in this paper. The system performance degradation due to the algorithm approximations for realizing the low complexity decoders is also investigated. The decoders are impleme...
متن کاملEnergy-efficient Hardware Accelerators for the SA-DCT and Its Inverse
The explosive growth of the mobile multimedia industry has accentuated the need for efficient VLSI implementations of the associated computationally demanding signal processing algorithms. In particular, the short battery life caused by excessive power consumption of mobile devices has become the biggest obstacle facing truly mobile multimedia. We propose novel hardware accelerator architecture...
متن کاملVLSI Array Architectures for Pyramid Vector QuantizationBongjin
We present parallel algorithms and array architectures for pyramid vector quantization (PVQ) 3] for use in image coding in low-power wireless systems. Both encoding and decoding algorithms have data-dependent iteration bounds and data-dependent dependencies which prevent eecient parallelization of the algorithms. We perform an algorithmic transformation 4] to convert data-dependent regular algo...
متن کامل